Overcoming Non-determinism in Testing Smart Devices: A Case Study

This paper presents a case study in ”black-box” assessment of a ”smart” device where, based only on the user manuals and the instrument itself, we try to build confidence in smart device reliability. To perform the black-box assessment, we developed a test environment which automates the generation of test data, their execution and interpretation of the results. The assessment was made more complex by the inherent non-determinism of the device. For example, non-determinism can arise due to inaccuracy in an analogue measurement made by the device when two alternative actions are possible depending on the measured value. This non-determinism makes it difficult to predict the output values that are expected from a test sequence of analogue input values. The paper presents two approaches to dealing with this difficulty: (1) based on avoidance of test values that could have multiple responses, (2) based on consideration of all possible interpretations of input data. To support the second approach we use advanced modelling and simulation techniques to predict all the likely interpretations and check whether any of them is observed at the smart device output

A test generation framework for quiescent real-time systems

We present an extension of Tretmans theory and algorithm for test generation for input-output transition systems to real-time systems. Our treatment is based on an operational interpretation of the notion of quiescence in the context of real-time behaviour. This gives rise to a family of implementation relations parameterized by observation durations for quiescence. We define a nondeterministic (parameterized) test generation algorithm that generates test cases that are sound with respect to the corresponding implementation relation. Also, the test generation is exhaustive in the sense that for each non-conforming implementation a test case can be generated that detects the non-conformance

Bounded Determinization of Timed Automata with Silent Transitions

Deterministic timed automata are strictly less expressive than their non-deterministic counterparts, which are again less expressive than those with silent transitions. As a consequence, timed automata are in general non-determinizable. This is unfortunate since deterministic automata play a major role in model-based testing, observability and implementability. However, by bounding the length of the traces in the automaton, effective determinization becomes possible. We propose a novel procedure for bounded determinization of timed automata. The procedure unfolds the automata to bounded trees, removes all silent transitions and determinizes via disjunction of guards. The proposed algorithms are optimized to the bounded setting and thus are more efficient and can handle a larger class of timed automata than the general algorithms. The approach is implemented in a prototype tool and evaluated on several examples. To our best knowledge, this is the first implementation of this type of procedure for timed automata.Comment: 25 page

Loss of genetic diversity as a signature of apricot domestication and diffusion into the Mediterranean Basin

Publication Inra prise en compte dans l'analyse bibliométrique des publications scientifiques mondiales sur les Fruits, les Légumes et la Pomme de terre. Période 2000-2012. http://prodinra.inra.fr/record/256699In order to reduce energy waste for artificial lights and subsequent air conditioning in plant growth chambers, the aim of this preliminary study was to evaluate the feasibility of growing the microvine under 100% of LED illumination. Plant growth under two different LED lights was compared amongst each other and with plants maintained in greenhouse conditions. Regarding the impact on the reproductive and vegetative systems, the study showed that LED light is suitable to grow microvines in confined environments. Plants exposed to LED light exhibited similar leaf emergence rate but reduced vegetative and reproductive organ size compared to plants grown in the greenhouse. Photosynthesis for plants exposed to LED light was higher than what is usually observed on grapevine under natural conditions

Grafting versus seed propagated apricot populations: two main gene pools in Tunisia evidenced by SSR markers and model-based Bayesian clustering

Apricot was introduced into the Mediterranean Basin from China and Asian mountains through the Middle-East and the Central Europe. Traditionally present in Tunisia, we were interested in accessing the origin of apricot species in the country, and in particular in the number and the location of its introductions. A set of 82 representative apricot accessions including 49 grafted cultivars and 33 seed propagated ‘Bargougs’ were genotyped using 24 microsatellite loci revealing a total of 135 alleles. The model-based Bayesian clustering analysis using both Structure and InStruct programs as well as the multivariate method revealed five distinct genetic clusters. The genetic differentiation among clusters showed that cluster 1, with only four cultivars, was the most differentiated from the four remaining genetic clusters, which constituted the largest part of the studied germplasm. According to their geographic origin, the five identified groups (north, centre, south, Gafsa oasis and other oases groups) enclosed a similar variation within group, with a low level of differentiation. Overall results highlighted the distinction of two apricot gene pools in Tunisia related to the different mode of propagation of the cultivars: grafted and seed propagated apricot, which enclosed a narrow genetic basis. Our findings support the assumption that grafting and seed propagated apricots shared the same origin

Testing real-time systems using TINA

The paper presents a technique for model-based black-box conformance testing of real-time systems using the Time Petri Net Analyzer TINA. Such test suites are derived from a prioritized time Petri net composed of two concurrent sub-nets specifying respectively the expected behaviour of the system under test and its environment.We describe how the toolbox TINA has been extended to support automatic generation of time-optimal test suites. The result is optimal in the sense that the set of test cases in the test suite have the shortest possible accumulated time to be executed. Input/output conformance serves as the notion of implementation correctness, essentially timed trace inclusion taking environment assumptions into account. Test cases selection is based either on using manually formulated test purposes or automatically from various coverage criteria specifying structural criteria of the model to be fulfilled by the test suite. We discuss how test purposes and coverage criterion are specified in the linear temporal logic SE-LTL, derive test sequences, and assign verdicts

LNCS

We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated